An Undecidable Property of Recurrent Double Sequences
نویسندگان
چکیده
منابع مشابه
An Undecidable Property of Recurrent Double Sequences
For an arbitrary finite algebra (A, f(·, ·), 0, 1) one defines a double sequence a(i, j) by a(i, 0) = a(0, j) = 1 and a(i, j) = f(a(i, j − 1), a(i − 1, j)). The problem if such recurrent double sequences are ultimately zero is undecidable, even if we restrict it to the class of commutative finite algebras. A.M.S.-Classification: 03D10.
متن کاملAn undecidable property of context-free languages
We prove that there exists no algorithm to decide whether the language generated by a context-free grammar is dense with respect to the lexicographic ordering. As a corollary to this result, we show that it is undecidable whether the lexicographic orderings of the languages generated by two context-free grammars have the same order type.
متن کاملDynamical systems with double recursion are undecidable
A primitive type of dynamical system is introduced. It is shown that there is no decision procedure able to answer if any such dynamical system is ultimately zero. A.M.S.-Classification: 12L05.
متن کامل$mathcal{I}_2$-convergence of double sequences of\ fuzzy numbers
In this paper, we introduce and study the concepts of $mathcal{I}_2$-convergence, $mathcal{I}_2^{*}$-convergence for double sequences of fuzzy real numbers, where $mathcal{I}_2$ denotes the ideal of subsets of $mathbb N times mathbb N$. Also, we study some properties and relations of them.
متن کاملWijsman Statistical Convergence of Double Sequences of Sets
In this paper, we study the concepts of Wijsman statistical convergence, Hausdorff statistical convergence and Wijsman statistical Cauchy double sequences of sets and investigate the relationship between them.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2008
ISSN: 0029-4527
DOI: 10.1215/00294527-2008-004